Ellipsis and higher-order unification

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher-Order and Semantic Unification

Abstrac t . We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard unification procedure, with slight modifications, can be used to solve the satisfiability problem in combinatory logic with a convergent set of algebraic axioms R, thus resulting in a complete higher-order unificatio...

متن کامل

Focus and Higher-Order Unification

Pulman has shown that Higher-Order Unifcat ion (HOU) can be used to model the interpretation of focus. In this paper, we extend the unification based approach to cases which are often seen as a test-bed for focus theory: utterances with multiple focus operators and second occurrence expressions. We then show that the resulting analysis favourably compares with two prominent theories of focus (n...

متن کامل

Corrections and Higher-Order Unification

We propose an analysis of corrections which models some of the requirements corrections place on context. We then show that this analysis naturally extends to the interaction of corrections with pronominal anaphora on the one hand, and (in)definiteness on the other. The analysis builds on previous unification–based approaches to NL semantics and relies on Higher–Order Unification with Equivalen...

متن کامل

Linear Higher-Order Pre-Unification

We develop an efficient representation and a pre-unification algorithm in the style of Huet for the This extended abstract has been submitted to the Twelfth Annual Symposium on Logic in Computer Science LICS’97, Warsaw, Poland, June 29th – July 2nd 1997. linear λ-calculus λ→−◦&> which includes intuitionistic functions (→), linear functions (−◦), additive pairing (&), and additive unit (>). Appl...

متن کامل

Optimizing Higher-Order Pattern Unification

We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern unification such as linearization, which eliminates many unnecessary occurs-checks. The presented modal framework explains a number of features of the current implementation of higher-order unification in Twelf and provides in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linguistics and Philosophy

سال: 1991

ISSN: 0165-0157,1573-0549

DOI: 10.1007/bf00630923